Using singularity analysis to approximate transient characteristics in queueing systems
نویسندگان
چکیده
In this paper, we develop a simple method to approximate the transient behavior of queueing systems. In particular, it is shown how singularity analysis of a known generating function of a transient sequence of some performance measure leads to an approximation of this sequence. To illustrate our approach, several specific transient sequences are investigated in detail. By means of some numerical examples, we validate our approximations and demonstrate the usefulness of the technique.
منابع مشابه
Multiple vacation policy for MX/Hk/1 queue with un-reliable server
This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملTransient Characteristics of a Single-Effect Absorption Refrigeration Cycle
This paper deals with a lumped-parameter dynamic simulation of a single-effect LiBr-H2O absorption chiller. In many studies the thermodynamic properties of LiBr-H2O solution were taken from some approximate relations causing the results to be somewhat inaccurate. These relations were used to solve simultaneous differential equations involving the continuity of species constituting the LiBr-H2O ...
متن کاملClosed queueing networks with finite capacity queues: approximate analysis
Queueing networks with finite capacity queues and blocking are applied to model systems with finite resources and population constraints, such as computer and communication systems, as well as traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors. When a customer attempts to enter a full capacity queue blocking occurs. The a...
متن کاملApproximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis
We propose a method to approximate the transient performance measures of a discrete time queueing system via a steady state analysis. The main idea is to approximate the system state at time slot t or on the n-th arrival—depending on whether we are studying the transient queue length or waiting time distribution—by the system state after a negative binomially distributed number of slots or arri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008